Multiplicities of jumping numbers
نویسندگان
چکیده
We study multiplicities of jumping numbers multiplier ideals in a smooth variety arbitrary dimension. prove that the multiplicity function is quasi-polynomial, hence proving Poincar\'e series rational function. further when various components quasi-polynomial have highest possible degree and relate it to contributed by Rees valuations. Finally, we special case monomial ideals.
منابع مشابه
Multiplicities and Reduction Numbers
Let (R,m) be a Cohen–Macaulay local ring and let I be an ideal. There are at least five algebras built on I whose multiplicity data affect the reduction number r(I) of the ideal. We introduce techniques from the Rees algebra theory of modules to produce estimates for r(I), for classes of ideals of dimension one and two. Previous cases of such estimates were derived for ideals of dimension zero.
متن کاملJumping Numbers of Hyperplane Arrangements
M. Saito [S] proved that the jumping numbers of a hyperplane arrangement depend only on the combinatorics of the arrangement. However, a formula in terms of the combinatorial data was still missing. In this note, we give a formula and a different proof of the fact that the jumping numbers of a hyperplane arrangement depend only on the combinatorics. We also give a combinatorial formula for part...
متن کاملGenerating non-jumping numbers recursively
Let r 2 be an integer. A real number ∈ [0, 1) is a jump for r if there is a constant c > 0 such that for any > 0 and any integer m wherem r , there exists an integer n0 such that any r-uniform graph with n>n0 vertices and density + contains a subgraph with m vertices and density + c. It follows from a fundamental theorem of Erdős and Stone that every ∈ [0, 1) is a jump for r = 2. Erdős asked wh...
متن کاملA note on non-jumping numbers
Let r ≥ 2 be an integer. A real number α ∈ [0, 1) is a jump for r if there exists c > 0 such that for any ǫ > 0 and any integer m, m ≥ r, there exists an integer n0 such that any r-uniform graph with n > n0 vertices and density ≥ α + ǫ contains a subgraph with m vertices and density ≥ α+ c. It follows from a theorem of Erdős and Stone that every α ∈ [0, 1) is a jump for r = 2. Erdős asked wheth...
متن کاملUsing Lagrangians of hypergraphs to find non-jumping numbers(II)
Let r ≥ 2 be an integer. A real number α ∈ [0, 1) is a jump for r if for any ε > 0 and any integer m, m ≥ r, any r-uniform graph with n > n0(ε, m) vertices and density at least α + ε contains a subgraph with m vertices and density at least α + c, where c = c(α) does not depend on ε or m. It follows from a result of Erdős, Stone, and Simonovits that every α ∈ [0, 1) is a jump for r = 2. Erdős as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebra & Number Theory
سال: 2023
ISSN: ['1944-7833', '1937-0652']
DOI: https://doi.org/10.2140/ant.2023.17.83